An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph
نویسنده
چکیده
A directed spanning tree in a directed graph G = (V,A) is a spanning tree such that no two arcs share their tails. In this paper, we propose an algorithm for listing all directed spanning trees of G. Its time and space complexities are O(|A| + ND(|V |, |A|)) and O(|A|+DS(|V |, |A|)), where D(|V |, |A|) and DS(|V |, |A|) are the time and space complexities of the data structure for updating the minimum spanning tree in an undirected graph with |V | vertices and |A| edges. Here N denotes the number of directed spanning trees in G.
منابع مشابه
A method for analyzing the problem of determining the maximum common fragments of temporal directed tree, that do not change with time
In this study two actual types of problems are considered and solved: 1) determining the maximum common connected fragment of the T-tree (T-directed tree) which does not change with time; 2) determining all maximum common connected fragments of the T-tree (T-directed tree) which do not change with time. The choice of the primary study of temporal directed trees and trees is justified by the wid...
متن کاملE ciently Scanning All Spanning Trees of an Undirected Graph
Let G be an undirected graph with V vertices and E edges. We consider the problem of enumerating all spanning trees of G: In order to explicitly output all spanning trees, the output size is of (NV ), where N is the number of spanning trees. This, however, can be compressed into (N) size. In this paper, we propose a new algorithm for enumerating all spanning trees of G in such compact form. The...
متن کاملSpanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective
For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components. A vertex separator S is minimal if it contains no other separator as a strict subset and a minimum vertex separator is a minimal vertex separator of least cardinality. A clique is a set of mutually adjacent vertices. A 2-tree is a connected graph in which every maximal clique is of size...
متن کامل0 Trees and Matchings Richard
In this article, Temperley’s bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed (and undirected) graphs, where edges carry nonnegative weights that induce a weighting on the set of spanning trees. We show that the weighted, directed spann...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996